Orthogonal basis for functions over a slice of the Boolean hypercube

نویسنده

  • Yuval Filmus
چکیده

We present a simple, explicit orthogonal basis of eigenvectors for the Johnson and Kneser graphs, based on Young’s orthogonal representation of the symmetric group. Our basis can also be viewed as an orthogonal basis for the vector space of all functions over a slice of the Boolean hypercube (a set of the form {(x1, . . . , xn) ∈ {0, 1} : ∑ i xi = k}), which refines the eigenspaces of the Johnson association scheme; our basis is orthogonal with repsect to any exchangeable measure. More concretely, our basis is an orthogonal basis for all multilinear polynomials R → R which are annihilated by the differential operator ∑ i ∂/∂xi. As an application of the last point of view, we show how to lift low-degree functions from a slice to the entire Boolean hypercube while maintaining properties such as expectation, variance and L-norm. As an application of our basis, we streamline Wimmer’s proof of Friedgut’s theorem for the slice. Friedgut’s theorem, a fundamental result in the analysis of Boolean functions, states that a Boolean function on the Boolean hypercube with low total influence can be approximated by a Boolean junta (a function depending on a small number of coordinates). Wimmer generalized this result to slices of the Boolean hypercube, working mostly over the symmetric group, and utilizing properties of Young’s orthogonal representation. Using our basis, we show how the entire argument can be carried out directly on the slice.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Orthogonal Basis for Functions over a Slice of the Boolean Hypercube

We present a simple, explicit orthogonal basis of eigenvectors for the Johnson and Kneser graphs, based on Young’s orthogonal representation of the symmetric group. Our basis can also be viewed as an orthogonal basis for the vector space of all functions over a slice of the Boolean hypercube (a set of the form {(x1, . . . , xn) ∈ {0, 1}n : ∑ i xi = k}), which refines the eigenspaces of the John...

متن کامل

Boolean constant degree functions on the slice are juntas

We show that a Boolean degree d function on the slice ([n] k ) = {(x1, . . . , xn) ∈ {0, 1} : ∑n i=1 xi = k} is a junta, assuming that k, n − k are large enough. This generalizes a classical result of Nisan and Szegedy on the hypercube. Moreover, we show that the maximum number of coordinates that a Boolean degree d function can depend on is the same on the slice and the hypercube.

متن کامل

Near Invariance of the Hypercube

We give an almost-complete description of orthogonal matrices M of order n that “rotate a non-negligible fraction of the Boolean hypercube Cn = {−1, 1} onto itself,” in the sense that Px∈Cn(Mx ∈ Cn) ≥ n −C , for some positive constant C, where x is sampled uniformly over Cn. In particular, we show that such matrices M must be very close to products of permutation and reflection matrices. This r...

متن کامل

Extended Jacobi and Laguerre Functions and their Applications

The aim of this paper is to introduce two new extensions of the Jacobi and Laguerre polynomials as the eigenfunctions of two non-classical Sturm-Liouville problems. We prove some important properties of these operators such as: These sets of functions are orthogonal with respect to a positive de nite inner product de ned over the compact intervals [-1, 1] and [0,1), respectively and also th...

متن کامل

A Survey of Direct Methods for Solving Variational Problems

This study presents a comparative survey of direct methods for solving Variational Problems. Thisproblems can be used to solve various differential equations in physics and chemistry like RateEquation for a chemical reaction. There are procedures that any type of a differential equation isconvertible to a variational problem. Therefore finding the solution of a differential equation isequivalen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015